全文获取类型
收费全文 | 7016篇 |
免费 | 1319篇 |
国内免费 | 1348篇 |
专业分类
电工技术 | 405篇 |
综合类 | 1129篇 |
化学工业 | 112篇 |
金属工艺 | 91篇 |
机械仪表 | 513篇 |
建筑科学 | 131篇 |
矿业工程 | 110篇 |
能源动力 | 66篇 |
轻工业 | 84篇 |
水利工程 | 76篇 |
石油天然气 | 63篇 |
武器工业 | 40篇 |
无线电 | 773篇 |
一般工业技术 | 366篇 |
冶金工业 | 37篇 |
原子能技术 | 13篇 |
自动化技术 | 5674篇 |
出版年
2024年 | 85篇 |
2023年 | 333篇 |
2022年 | 482篇 |
2021年 | 442篇 |
2020年 | 290篇 |
2019年 | 220篇 |
2018年 | 219篇 |
2017年 | 256篇 |
2016年 | 262篇 |
2015年 | 327篇 |
2014年 | 390篇 |
2013年 | 409篇 |
2012年 | 544篇 |
2011年 | 538篇 |
2010年 | 429篇 |
2009年 | 480篇 |
2008年 | 499篇 |
2007年 | 470篇 |
2006年 | 443篇 |
2005年 | 372篇 |
2004年 | 297篇 |
2003年 | 265篇 |
2002年 | 199篇 |
2001年 | 197篇 |
2000年 | 166篇 |
1999年 | 167篇 |
1998年 | 123篇 |
1997年 | 132篇 |
1996年 | 93篇 |
1995年 | 95篇 |
1994年 | 78篇 |
1993年 | 60篇 |
1992年 | 53篇 |
1991年 | 44篇 |
1990年 | 42篇 |
1989年 | 34篇 |
1988年 | 35篇 |
1987年 | 10篇 |
1986年 | 11篇 |
1985年 | 11篇 |
1984年 | 16篇 |
1983年 | 7篇 |
1982年 | 11篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1976年 | 8篇 |
1975年 | 4篇 |
1973年 | 3篇 |
排序方式: 共有9683条查询结果,搜索用时 93 毫秒
11.
采用封闭网络模型,按照电路元件参数,采用开路、短路和着色运算,将电路图逐层分解,得到网络展开图.给出网络展开图的概念和运算规则,指出网络展开图中从根到末稍每个路径的值就是网络行列式展开式中的一个有效项,从而由网络展开图得到符号网络函数.该方法直接对电路图进行运算,不需要建立任何形式的电路方程和行列式,适用于一般的有源电路,而且能生成各种类型的网络函数. 相似文献
12.
A system for person-independent classification of hand postures against complex backgrounds in video images is presented. The system employs elastic graph matching, which has already been successfully applied for object and face recognition. We use the bunch graph technique to model variance in hand posture appearance between different subjects and variance in backgrounds. Our system does not need a separate segmentation stage but closely integrates finding the object boundaries with posture classification. 相似文献
13.
This paper describes the nature of mathematical discovery (including concept definition and exploration, example generation, and theorem conjecture and proof), and considers how such an intelligent process can be simulated by a machine. Although the material is drawn primarily from graph theory, the results are immediately relevant to research in mathematical discovery and learning.The thought experiment, a protocol paradigm for the empirical study of mathematical discovery, highlights behavioral objectives for machine simulation. This thought experiment provides an insightful account of the discovery process, motivates a framework for describing mathematical knowledge in terms of object classes, and is a rich source of advice on the design of a system to perform discovery in graph theory. The evaluation criteria for a discovery system, it is argued, must include both a set of behavior to display (behavioral objectives) and a target set of facts to be discovered (factual knowledge).Cues from the thought experiment are used to formulate two hierarchies of representational languages for graphy theory. The first hierarchy is based on the superficial terminology and knowledge of the thought experiment. Generated by formal grammars with set-theoretic semantics, this eminently reasonable approach ultimately fails to meet the factual knowledge criteria. The second hierarchy uses declarative expressions, each of which has a semantic interpretation as a stylized, recursive algorithm that defines a class by generating it correctly and completely. A simple version of one such representation is validated by a successful, implemented system called Graph Theorist (GT) for mathematical research in graph theory. GT generates correct examples, defines and explores new graph theory properties, and conjectures and proves theorems.Several themes run through this paper. The first is the dual goals, behavioral objectives and factural knowledge to be discovered, and the multiplicity of their demands on a discovery system. The second theme is the central role of object classes to knowledge representation. The third is the increased power and flexibility of a constructive (generator) definition over the more traditional predicate (tester) definition. The final theme is the importance of examples and recursion in mathematical knowledge. The results provide important guidance for further research in the simulation of mathematical discovery. 相似文献
14.
One of the problems encountered by automatic feeding devices, such as vibratory bowl feeders, in robotic assembly systems is nesting which leads to inseparability of parts and jamming. In this paper, we describe a design evaluation procedure to determine whether a part is prone to nesting and to quantify the degree of nesting. The proposed methodology reduces the 3-D protrusion-hole polyhedral containment problem of nesting to a 2-D polygon containment problem by employing a loop-based feature recognition scheme. Subsequently, the 3-D containment configuration is reconstructed from that of the 2-D by using a strategy calleddrop, pull and push. In this context, we introduce the notion of axis as a characteristic direction of a feature that facilitates the analysis of generalized 3-D polyhedral containment. The algorithms are applicable to generic B-Rep CAD data, and their time and space complexities are polynomial. 相似文献
15.
16.
本文提出二种算法分别标号和计数线性八元树表示的三维客体群的连通分量.这些操作典型地需要检查线性八元树中诸八分体在三个主方向上的面邻接对.根据这些邻接对,可以建造在计算机中用关联矩阵表示的邻接图.连通分量标号和计数是在关联矩阵上分别执行相应的操作而完成的.连通分量标号的执行时间是O(n+m·logm),而连通分量计数需要O(n)时间,其中m和n分别是线性八元树中八分体和邻接对的数目. 相似文献
17.
This study was motivated by some difficulties encountered by the authors when trying to express temporal knowledge using Sowa's conceptual graph (CG) approach. An overview of Sowa's approach is given and the difficulties encountered when trying to model temporal knowledge are outlined: the disparity of notations allowed by CG theory for expressing temporal information; the ambiguity and incompleteness of tense sspecification; the difficulty of harmonizing tenses and intergraph temporal relations. Various approaches suggested for representing time both in artificial intelligence and linguistics are presented, and an extension to Sowa's approach is proposed in which temporal and nontemporal knowledge are differentiated. In this model points in time are represented as well as time intervals. A semantic interpretation of verbs is provided based on an extension of Reichenbach's model of temporal markers. The authors show how their approach enables the representation of tenses as well as the aspectual properties of natural language sentences. 相似文献
18.
Waveband switching (WBS) is a promising technique to reduce the switching and transmission costs in the optical domain of a wavelength-division multiplexing (WDM) network. This paper considers the problem of provisioning dynamic traffic using WBS in a WDM mesh network. The network of interest is a homogeneous WBS network, where each node has the functionality of WBS. The problem is called the dynamic WBS problem, which involves searching waveband-routes or wavelength-routes for the dynamically arriving traffic requests. The objective is to minimize the total switching and transmission costs in the optical domain. To solve the dynamic WBS problem, an auxiliary graph model capturing the network state is proposed. Based on the auxiliary graph, two heuristic on-line WBS algorithms with different waveband grouping policies are proposed, namely the wavelength-first WBS algorithm based on the auxiliary graph (WFAUG) and the waveband-first WBS algorithm based on the auxiliary graph (BFAUG). Simulation results indicate that WBS is an attractive technique which reduces the overall switching and transmission costs by up to 30% in the network. The results also show that the WFAUG algorithm outperforms the BFAUG algorithm in terms of port savings and cost savings. 相似文献
19.
本文基于静态相关性分析和动态调整相结合的方法,提出了一种逻辑程序的执行模型,它不仅开发了“与“并行,同进也开发了一定的“或“并行,从而有效地加速了逻辑程序的执行。 相似文献
20.
PRO——一种新的地震资料处理方法 总被引:2,自引:0,他引:2
PRO(影像的参数展开)技术是由俄罗斯地球物理学家开发的一种崭新的地震资料处理技术。本文从PRO基本原理入手,简单介绍了PRO的速度分析原理。PRO速度分析和成像均以信号的椭圆展开和参数展开为基础,其中参数展开方法考虑波型转换、介质的横向不均匀造成传播速度的变化。该技术抛开了传统共中心点叠加的思想,从根本上解决了以CMP方法为基础的传统地震处理技术遇到的困难。通过模型与实例分析对比,PRO比传统CMP方法更优越。 相似文献